Finding bipartite subgraphs efficiently
نویسندگان
چکیده
Polynomial algorithms are given for the following two problems: • given a graph with n vertices and m edges, where m ≥ 3n3/2, find a complete balanced bipartite subgraph with parts about lnn ln(n/m) , • given a graph with n vertices, find a decomposition of its edges into complete balanced bipartite graphs having altogether O(n2/ lnn) vertices. Previous proofs of the existence of such objects, due to Kővári-Sós-Turán [10], Chung-Erdős-Spencer [5], Bublitz [4] and Tuza [13] were non-constructive.
منابع مشابه
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
For an undirected graph without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of is even; (ii) that the number of the closed patterns is precisely double the number of maximal complete bipartite subgraphs of ; (iii) that for every maximal complete bipartite subgraph, there always exists a unique and distinct pair of closed patterns that matches the two vert...
متن کاملMaximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs
We study the node-deletion problem consisting of finding a maximum weighted induced bipartite subgraph of a planar graph with maximum degree three. We show that this is polynomially solvable. It was shown in [4] that it is NP-complete if the maximum degree is four. We also extend these ideas to the problem of balancing signed graphs. We also consider maximum weighted induced acyclic subgraphs o...
متن کاملCS599: Structure and Dynamics of Networked Information (Spring 2005) 02/07/2005: The Search for Communities
We previously looked at communities as simply dense subgraphs graphs, or as subgraphs such that each node has a large fraction of its edges inside. Another view, taken in [3], starts from the hubs and authorities model. It argues that a structure of densely linked hubs and authorities is a common feature of communities. Such a core, a dense bipartite graph, can be considered the “signature” of ...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملPartitioning the vertex set of a bipartite graph into complete bipartite subgraphs
Given a graph and a positive integer k, the biclique vertex-partition problem asks whether the vertex set of the graph can be partitioned into at most k bicliques (connected complete bipartite subgraphs). It is known that this problem is NP-complete for bipartite graphs. In this paper we investigate the computational complexity of this problem in special subclasses of bipartite graphs. We prove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 110 شماره
صفحات -
تاریخ انتشار 2010